1 2 M ay 2 00 6 Bounds on graph eigenvalues
نویسنده
چکیده
We refute, improve or amplify some recent results on graph eigenvalues. In particular, we prove that if G is a graph of order n ≥ 2, maximum degree ∆, and girth at least 5, then the maximum eigenvalue μ (G) of the adjacency matrix of G satisfies μ (G) ≤ min {
منابع مشابه
. SP ] 2 4 M ay 2 00 7 Differential inequalities for Riesz means and Weyl - type bounds for eigenvalues 1
We derive differential inequalities and difference inequalities for Riesz means of eigenvalues of the Dirichlet Laplacian, Rσ(z) := ∑ k (z − λk) σ +. Here {λk} ∞ k=1 are the ordered eigenvalues of the Laplacian on a bounded domain Ω ⊂ Rd, and x+ := max(0, x) denotes the positive part of the quantity x. As corollaries of these inequalities, we derive Weyl-type bounds on λk, on averages such as λ...
متن کاملA ug 2 00 6 Bounds on graph eigenvalues
We improve some recent results on graph eigenvalues. In particular, we prove that if G is a graph of order n ≥ 2, maximum degree ∆, and girth at least 5, then μ (G) ≤ min {
متن کاملOn the eigenvalues of some matrices based on vertex degree
The aim of this paper is to compute some bounds of forgotten index and then we present spectral properties of this index. In continuing, we define a new version of energy namely ISI energy corresponded to the ISI index and then we determine some bounds for it.
متن کامل. C O ] 9 M ay 2 00 9 On Longest Cycle C of a Graph G via Structures of G −
Two sharp lower bounds for the length of a longest cycle C of a graph G are presented in terms of the lengths of a longest path and a longest cycle of G − C, denoted by p and c, respectively, combined with minimum degree δ: (1) |C| ≥ (p + 2)(δ − p) and (2) |C| ≥ (c + 1)(δ − c + 1).
متن کاملSharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کامل